Minimal Deterministic Incomplete Automata
نویسندگان
چکیده
We construct a minimal automaton for an output-incomplete Moore automaton. The approach is motivated by physical interpretation of seeing deterministic nite automata as models for elementary particles. When compared to some classical methods our minimal automaton is unique up to an isomorphism and preserves also the unde ned or unspeci ed behaviour of the original automaton.
منابع مشابه
Reduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کاملMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
متن کاملOn a structural property in the state complexity of projected regular languages
A transition is unobservable if it is labeled by a symbol removed by a projection. The present paper investigates a new structural property of incomplete deterministic finite automata – a number of states incident with an unobservable transition – and its effect on the state complexity of projected regular languages. We show that the known upper bound can be met only by automata with one unobse...
متن کاملOn minimal realization of IF-languages: A categorical approach
he purpose of this work is to introduce and study the concept of minimal deterministic automaton with IF-outputs which realizes the given IF-language. Among two methods for construction of such automaton presented here, one is based on Myhill-Nerode's theory while the other is based on derivatives of the given IF-language. Meanwhile, the categories of deterministic automata with IF-outputs and ...
متن کاملOn Properties and State Complexity of Deterministic State-Partition Automata
A deterministic automaton accepting a regular language L is a state-partition automaton with respect to a projection P if the state set of the deterministic automaton accepting the projected language P (L), obtained by the standard subset construction, forms a partition of the state set of the automaton. In this paper, we study fundamental properties of state-partition automata. We provide a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 3 شماره
صفحات -
تاریخ انتشار 1997